# fib = lambda n: n if n < 2 else 2 * fib(n-1)

# def func(alist, val):
#     low = 0
#     h = len(alist)-1
#     while low <= h:
#         mid = (fow + h) // 2
#         if alist[mid] == val:
#             return ok
#         elif alist[mid] < val:
#             low = mid + 1
#         else:
#             h = mid - 1
#     return

# def func(alist):
#     if len(alist) < 2:
#         return alist
    
#     row = alist[0]
    
#     a = [x for x in alist[1:] if x <= row]
#     b = [x for x in alist[1:] if x > row]
#     return func(a) + row + func(b)



# def func(alist):
#     for i in range(len(alist)-1):
#         for j in range(len(alist)-i-1):
#             if alist[j] > alist[j+1]:
#                 alist[j],alist[j+1] = alist[j+1],alist[j]


# def func(n):
#     if n == 0:
#         return n
#     elif n == 1:
#         return n
#     else:
#         return func(n-2) + func(n-1)